package Euler12;

import ReusableCode.*;

public class DivisibleTriangularNumber {
	public static void main(String[] args) {
		long count = 1;
		long number = 0;
		
		while(true)
		{
			number += count;
			count++;
			
			if(MathFunctions.getDivisors(number).size() > 500)
			{
				System.out.println("The highly divisible number is: " + number);
				break;
			}
			
			System.out.println(number);
		}
	}
}
